#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <list>

#define sf(x) scanf("%d", &x)
#define pf(x) printf("%d ", x)
#define pf2(x,y) printf("%d %d ", x,y)
#define sf2(x,y) scanf("%d %d", &x,&y)
#define sff(x) scanf("%lf", &x)
#define pff(x) printf("%lf ", x)
#define ENDL printf("\n")
#define pfl(x) printf("%I64d ", x)
#define sfl(x) scanf("%I64d", &x)



using namespace std;


typedef long long ll;

int main()
{
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	string s;
	int a,b;
	bool f1,f2;
	cin>>s;
	while(s!="#")
	{
		f1=0;
		f2=0;
		int i=0;
		if(s[i]=='n')
		{
			f1=true;
			a=0;
			b=1;
			i+=5;
		}
		else
		{
			f2=true;
			a=90;
			b=1;
			i+=4;
		}
		
		for(; i<s.size();)
		{
			if(s[i]=='n')
			{
				f1=true;
				a*=2;
				b*=2;
				a-=90;
				if(!f2) a=0;
				i+=5;
			}
			else if(s[i]=='w')
			{
				f2=true;
				a*=2;
				b*=2;
				a+=90;
				if(!f1) a=90*b;
				i+=4;
			}
		}
		while(a%2==0&&b>1&&a!=0)
		{
			a/=2;
			b/=2;
		}
		if(a==0||b ==1)
		{
			printf("%d\n",a);
		}
		else
		{
			printf("%d/%d\n",a,b);
		}
		cin>>s;
	}
	return 0;
}




